Tensor decomposition and homotopy continuation
نویسندگان
چکیده
منابع مشابه
Homotopy Techniques for Tensor Decomposition and Perfect Identifiability
Let T be a general complex tensor of format (n1, ..., nd). When the fraction ∏ i ni/[1+ ∑ i(ni−1)] is an integer, and a natural inequality (called balancedness) is satisfied, it is expected that T has finitely many minimal decomposition as a sum of decomposable tensors. We show how homotopy techniques allow us to find all the decompositions of T , starting from a given one. In particular this g...
متن کاملTropical Homotopy Continuation
Inspired by numerical homotopy methods we propose a combinatorial homotopy algorithm for finding all isolated solutions to a tropical polynomial systems of n tropical polynomials in n variables. In particular, a tropicalisation of the numerical “regeneration” technique leads to a new method for enumerating the mixed cells of a mixed subdivision. This tropical approach shares some ideas with the...
متن کاملSolving Nonlinear Equations by Adaptive Homotopy Continuation*
Standard homotopy continuation methods for solving systems of nonlinear equations require the continuation parameter to move from 0 to 1 along the real line. Diffkulties can occur, however, if a point of singularity is encountered during the course of the integration. To ameliorate these diffkulties, this paper proposes extending the continuation parameter to complex values and adaptively compu...
متن کاملHomotopy Continuation Methods for Nonlinear Complementarity Problems
A complementarity problem with a continuous mapping f from R n into itself can be written as the system of equations F(x, y ) = 0 and ( x , y ) > 0. Here F is the mapping from R ~ " into itself defined by F(x, y) = ( x l y ,, x 2 y Z , . . . , x , ~ y e , y f f x ) ) . Under the assumption that the mapping f is a P,,-function, we study various aspects of homotopy continuation methods that trace...
متن کاملHomotopy Analysis for Tensor PCA
Developing efficient and guaranteed nonconvex algorithms has been an important challenge in modern machine learning. Algorithms with good empirical performance such as stochastic gradient descent often lack theoretical guarantees. In this paper, we analyze the class of homotopy or continuation methods for global optimization of nonconvex functions. These methods start from an objective function...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Differential Geometry and its Applications
سال: 2017
ISSN: 0926-2245
DOI: 10.1016/j.difgeo.2017.07.009